Voltage Assignment with Guaranteed Probability Satisfying Timing Constraint for Real-time Multiproceesor DSP
نویسندگان
چکیده
Dynamic Voltage Scaling (DVS) is one of the techniques used to obtain energy-saving in real-time DSP systems. In many DSP systems, some tasks contain conditional instructions that have different execution times for different inputs. Due to the uncertainties in execution time of these tasks, this paper models each varied execution time as a probabilistic random variable and solves the Voltage Assignment with Probability (VAP) Problem. VAP problem involves finding a voltage level to be used for each node of an date flow graph (DFG) in uniprocessor and multiprocessor DSP systems. This paper proposes two optimal algorithms, one for uniprocessor and one for multiprocessor DSP systems, to minimize the expected total energy consumption while satisfying the timing constraint with a guaranteed confidence probability. The experimental results show that our approach achieves significant energy saving than previous work. For example, our algorithm for multiprocessor achieves an average improvement of 56.1% on total energy-saving with 0.80 probability satisfying timing constraint.
منابع مشابه
Efficient Assignment with Guaranteed Probability for Heterogeneous Parallel DSP
In real-time digital signal processing (DSP) architectures using heterogeneous functional units (FUs), it is critical to select the best FU for each task. However, some tasks may not have fixed execution times. This paper models each varied execution time as a probabilistic random variable and solves heterogeneous assignment with probability (HAP) problem. The solution of the HAP problem assign...
متن کاملLoop Scheduling to Minimize Cost with Data Mining and Prefetching for Heterogeneous Dsp
In real-time embedded systems, such as multimedia and video applications, cost and time are the most important issues and loop is the most critical part. Due to the uncertainties in execution time of some tasks, this paper models each varied execution time as a probabilistic random variable. We proposes a novel algorithm to minimize the total cost while satisfying the timing constraint with a g...
متن کاملAdaptive Online Energy Saving for Heterogeneous Sensor Networks
Sensor nodes usually work under dynamic changing, hard-to-predict environments and have limited lifetime. We use a novel adaptive online energy saving (AOES) algorithm to save total energy consumption for heterogeneous sensor networks. Due to the uncertainties in execution time of some tasks and multiple working mode of each node, this paper models each varied execution time as a probabilistic ...
متن کاملRegister Files Constraint Satisfaction during Scheduling of DSP Code
Algorithms in digital signal processing (DSP) impose tight timing constraints that the compiler has to respect while considering the limited capacity of the available register files in a target DSP processor. Traditional code generation methods that schedule spill code to satisfy storage capacity may take many iterations and are usually not capable of satisfying the timing constraints. In this ...
متن کاملEnergy Minimization for Heterogeneous Wireless Sensor Network
Lifetime is very important to wireless sensor networks since most sensors are equipped with non-rechargeable batteries. Therefore, energy and delay are critical issues for the research of sensor networks. that have limited lifetime. Due to the uncertainties in execution time of some tasks, this paper models each varied execution time as a probabilistic random variable with the consideration of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- VLSI Signal Processing
دوره 46 شماره
صفحات -
تاریخ انتشار 2007